Discontinuities in pattern inference

Institutional Repository Discontinuities in pattern inference

This paper deals with the inferrability of classes of E-pattern languages—also referred to as extended or erasing pattern languages—from positive data in Gold’s model of identification in the limit. The first main part of the paper shows that the recently presented negative result on terminal-free E-pattern languages over binary alphabets does not hold for other alphabet sizes, so that the full...

A Discontinuity in Pattern Inference

This paper examines the learnability of a major subclass of E-pattern languages – also known as erasing or extended pattern languages – in Gold’s learning model: We show that the class of terminal-free E-pattern languages is inferrable from positive data if the corresponding terminal alphabet consists of three or more letters. Consequently, the recently presented negative result for binary alph...

Pattern Inference under many Guises

Navigation Pattern Discovery Using Grammatical Inference

We present a method for modeling user navigation on a web site using grammatical inference of stochastic regular grammars. With this method we achieve better models than the previously used first order Markov chains, in terms of predictive accuracy and utility of recommendations. In order to obtain comparable results, we apply the same grammatical inference algorithms on Markov chains, modeled ...

Pattern-Based Compaction for ProbLog Inference

The probabilistic inference of current Probabilistic Logic Programming systems uses weighted model counting (WMC). To compute the success probability of a query, first the set of proofs of the query is computed. Next, the set of proofs is converted into a corresponding Boolean formula which is compiled into a suitable representation that allows WMC in polynomial time. The computational cost of ...